On the optimal solution of interval linear complementarity problems
نویسندگان
چکیده
منابع مشابه
On the optimal solution of interval linear complementarity problems
We consider compact intervals [a, a] := {x ∈ IR : a ≤ x ≤ a} and denote the set of all such intervals by IR. We also write [a] instead of [a, a]. Furthermore, we consider matrices with an interval in each of its elements; i.e., [A,A] = ([aij ]) = ([aij , aij ]). We also write [A,A] := {A ∈ IRn×n : A ≤ A ≤ A}. By IRn×n we denote the set of all these so-called interval matrices. We also write [A]...
متن کاملThe optimal solution set of the interval linear programming problems
Determining the set of all optimal solutions of a linear program with interval data is one of the main problems discussed in interval optimization. We review two methods based on duality in linear programming, which are used to approximate the optimal set. Additionally, another decomposition method based on complementary slackness is proposed. This method provides the exact description of the o...
متن کاملOn Optimal Solution of Interval Linear Equations
For interval linear algebraic systems Ax = b, the problem is considered of componentwise evaluation of the set Σ∃∃(A,b) = {Ab | A∈A, b∈b } formed by all solutions of Ax = b when A and b vary independently in A and b, respectively. An iterative PSS algorithm is introduced that computes optimal (exact) componentwise estimates of Σ∃∃ and its convergence is proved under fairly general conditions on...
متن کاملRemarks on the Numerical Solution of Certain Linear Complementarity Problems
In a recent paper, J. K. Aitchison and N. K. Upton have proposed a mathematical model of the behaviour of a cloud formed immediately after the sudden release of a pollutant, together with an algorithm for determining numerical solutions of the resulting system of constrained nonlinear equations and complementarity relations. This algorithm requires, at each step, the solution of a special Linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2003
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200310524